0.11/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.11/0.12 % Command : run_E %s %d THM 0.12/0.33 % Computer : n006.cluster.edu 0.12/0.33 % Model : x86_64 x86_64 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.33 % Memory : 8042.1875MB 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.12/0.33 % CPULimit : 1440 0.12/0.33 % WCLimit : 180 0.12/0.33 % DateTime : Thu Jul 4 07:17:09 EDT 2024 0.12/0.33 % CPUTime : 0.21/0.48 Running higher-order theorem proving 0.21/0.48 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox2/tmp/tmp.hKUKP0YYET/E---3.1_28485.p 25.71/3.74 # Version: 3.2.0-ho 25.71/3.74 # Preprocessing class: HSSSSMSSSSSNHHA. 25.71/3.74 # Scheduled 5 strats onto 8 cores with 180 seconds (1440 total) 25.71/3.74 # Starting sh2lt with 720s (4) cores 25.71/3.74 # Starting new_ho_10_unif with 180s (1) cores 25.71/3.74 # Starting full_lambda_6 with 180s (1) cores 25.71/3.74 # Starting post_as_ho1 with 180s (1) cores 25.71/3.74 # Starting ehoh_best3_rw with 180s (1) cores 25.71/3.74 # post_as_ho1 with pid 28566 completed with status 0 25.71/3.74 # Result found by post_as_ho1 25.71/3.74 # Preprocessing class: HSSSSMSSSSSNHHA. 25.71/3.74 # Scheduled 5 strats onto 8 cores with 180 seconds (1440 total) 25.71/3.74 # Starting sh2lt with 720s (4) cores 25.71/3.74 # Starting new_ho_10_unif with 180s (1) cores 25.71/3.74 # Starting full_lambda_6 with 180s (1) cores 25.71/3.74 # Starting post_as_ho1 with 180s (1) cores 25.71/3.74 # No SInE strategy applied 25.71/3.74 # Search class: HGHNF-FFSF22-SHHFFSBN 25.71/3.74 # Scheduled 6 strats onto 1 cores with 180 seconds (180 total) 25.71/3.74 # Starting new_ho_10_unif with 54s (1) cores 25.71/3.74 # new_ho_10_unif with pid 28572 completed with status 0 25.71/3.74 # Result found by new_ho_10_unif 25.71/3.74 # Preprocessing class: HSSSSMSSSSSNHHA. 25.71/3.74 # Scheduled 5 strats onto 8 cores with 180 seconds (1440 total) 25.71/3.74 # Starting sh2lt with 720s (4) cores 25.71/3.74 # Starting new_ho_10_unif with 180s (1) cores 25.71/3.74 # Starting full_lambda_6 with 180s (1) cores 25.71/3.74 # Starting post_as_ho1 with 180s (1) cores 25.71/3.74 # No SInE strategy applied 25.71/3.74 # Search class: HGHNF-FFSF22-SHHFFSBN 25.71/3.74 # Scheduled 6 strats onto 1 cores with 180 seconds (180 total) 25.71/3.74 # Starting new_ho_10_unif with 54s (1) cores 25.71/3.74 # Preprocessing time : 0.001 s 25.71/3.74 # Presaturation interreduction done 25.71/3.74 25.71/3.74 # Proof found! 25.71/3.74 # SZS status Theorem 25.71/3.74 # SZS output start CNFRefutation 25.71/3.74 thf(decl_sort1, type, a: $tType). 25.71/3.74 thf(decl_22, type, cLQ: a > a > $o). 25.71/3.74 thf(decl_23, type, esk1_0: (a > $o) > a). 25.71/3.74 thf(decl_24, type, esk2_2: (a > $o) > a > a). 25.71/3.74 thf(decl_25, type, esk3_0: a > a). 25.71/3.74 thf(cTHM145L1_pme, conjecture, ![X1:(a > $o) > a]:(((![X2:a, X3:a, X4:a]:((((cLQ @ X3 @ X4)&(cLQ @ X2 @ X3))=>(cLQ @ X2 @ X4)))&![X5:a > $o]:((![X4:a]:(((cLQ @ X4 @ (X1 @ X5))<=(X5 @ X4)))&![X6:a]:(((cLQ @ (X1 @ X5) @ X6)<=![X7:a]:(((X5 @ X7)=>(cLQ @ X7 @ X6))))))))=>![X8:a > a]:((![X2:a, X3:a]:(((cLQ @ (X8 @ X2) @ (X8 @ X3))<=(cLQ @ X2 @ X3)))=>?[X9:a]:(((cLQ @ X9 @ (X8 @ X9))&(cLQ @ (X8 @ X9) @ X9))))))), file('/export/starexec/sandbox2/tmp/tmp.hKUKP0YYET/E---3.1_28485.p', cTHM145L1_pme)). 25.71/3.74 thf(c_0_1, negated_conjecture, ~(![X1:(a > $o) > a]:(((![X2:a, X3:a, X4:a]:((((cLQ @ X3 @ X4)&(cLQ @ X2 @ X3))=>(cLQ @ X2 @ X4)))&![X5:a > $o]:((![X4:a]:(((X5 @ X4)=>(cLQ @ X4 @ (X1 @ X5))))&![X6:a]:((![X7:a]:(((X5 @ X7)=>(cLQ @ X7 @ X6)))=>(cLQ @ (X1 @ X5) @ X6))))))=>![X8:a > a]:((![X2:a, X3:a]:(((cLQ @ X2 @ X3)=>(cLQ @ (X8 @ X2) @ (X8 @ X3))))=>?[X9:a]:(((cLQ @ X9 @ (X8 @ X9))&(cLQ @ (X8 @ X9) @ X9)))))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM145L1_pme])])). 25.71/3.74 thf(c_0_2, negated_conjecture, ![X23:a, X24:a, X25:a, X26:a > $o, X27:a, X28:a, X31:a, X32:a, X33:a]:((((~(cLQ @ X24 @ X25)|~(cLQ @ X23 @ X24)|(cLQ @ X23 @ X25))&((~(X26 @ X27)|(cLQ @ X27 @ (esk1_0 @ X26)))&(((X26 @ (esk2_2 @ X26 @ X28))|(cLQ @ (esk1_0 @ X26) @ X28))&(~(cLQ @ (esk2_2 @ X26 @ X28) @ X28)|(cLQ @ (esk1_0 @ X26) @ X28)))))&((~(cLQ @ X31 @ X32)|(cLQ @ (esk3_0 @ X31) @ (esk3_0 @ X32)))&(~(cLQ @ X33 @ (esk3_0 @ X33))|~(cLQ @ (esk3_0 @ X33) @ X33))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])])). 25.71/3.74 thf(c_0_3, negated_conjecture, ![X4:a, X3:a, X2:a]:(((cLQ @ X4 @ X3)|~((cLQ @ X2 @ X3))|~((cLQ @ X4 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_2])). 25.71/3.74 thf(c_0_4, negated_conjecture, ![X5:a > $o, X2:a]:(((X5 @ (esk2_2 @ X5 @ X2))|(cLQ @ (esk1_0 @ X5) @ X2))), inference(split_conjunct,[status(thm)],[c_0_2])). 25.71/3.74 thf(c_0_5, negated_conjecture, ![X2:a, X18:a > a, X8:a > a, X3:a]:(((cLQ @ (X8 @ (esk2_2 @ (^[Z0/* 3 */:a]:((cLQ @ (X8 @ Z0) @ (X18 @ Z0)))) @ X2)) @ X3)|(cLQ @ (esk1_0 @ (^[Z0/* 3 */:a]:((cLQ @ (X8 @ Z0) @ (X18 @ Z0))))) @ X2)|~((cLQ @ (X18 @ (esk2_2 @ (^[Z0/* 3 */:a]:((cLQ @ (X8 @ Z0) @ (X18 @ Z0)))) @ X2)) @ X3)))), inference(spm,[status(thm)],[c_0_3, c_0_4])). 25.71/3.74 thf(c_0_6, negated_conjecture, ![X2:a, X3:a]:(((cLQ @ (esk3_0 @ X2) @ (esk3_0 @ X3))|~((cLQ @ X2 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_2])). 25.71/3.74 thf(c_0_7, negated_conjecture, ![X5:a > $o, X2:a]:(((cLQ @ X2 @ (esk1_0 @ X5))|~((X5 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_2])). 25.71/3.74 thf(c_0_8, negated_conjecture, ![X2:a, X18:a > a, X8:a > a, X3:a]:(((cLQ @ (X8 @ (esk2_2 @ (^[Z0/* 3 */:a]:((cLQ @ (X8 @ Z0) @ (esk3_0 @ (X18 @ Z0))))) @ X2)) @ (esk3_0 @ X3))|(cLQ @ (esk1_0 @ (^[Z0/* 3 */:a]:((cLQ @ (X8 @ Z0) @ (esk3_0 @ (X18 @ Z0)))))) @ X2)|~((cLQ @ (X18 @ (esk2_2 @ (^[Z0/* 3 */:a]:((cLQ @ (X8 @ Z0) @ (esk3_0 @ (X18 @ Z0))))) @ X2)) @ X3)))), inference(spm,[status(thm)],[c_0_5, c_0_6])). 25.71/3.74 thf(c_0_9, negated_conjecture, ![X40:a > a > $o, X2:a]:(((cLQ @ (esk2_2 @ (^[Z0/* 3 */:a]:((X40 @ Z0 @ Z0))) @ X2) @ (esk1_0 @ (^[Z0/* 3 */:a]:((X40 @ Z0 @ Z0)))))|(cLQ @ (esk1_0 @ (^[Z0/* 3 */:a]:((X40 @ Z0 @ Z0)))) @ X2))), inference(spm,[status(thm)],[c_0_7, c_0_4])). 25.71/3.74 thf(c_0_10, negated_conjecture, ![X5:a > $o, X2:a]:(((cLQ @ (esk1_0 @ X5) @ X2)|~((cLQ @ (esk2_2 @ X5 @ X2) @ X2)))), inference(split_conjunct,[status(thm)],[c_0_2])). 25.71/3.74 thf(c_0_11, negated_conjecture, ![X2:a]:(((cLQ @ (esk2_2 @ (^[Z0/* 3 */:a]:((cLQ @ Z0 @ (esk3_0 @ Z0)))) @ X2) @ (esk3_0 @ (esk1_0 @ (^[Z0/* 3 */:a]:((cLQ @ Z0 @ (esk3_0 @ Z0)))))))|(cLQ @ (esk1_0 @ (^[Z0/* 3 */:a]:((cLQ @ Z0 @ (esk3_0 @ Z0))))) @ X2))), inference(spm,[status(thm)],[c_0_8, c_0_9])). 25.71/3.74 thf(c_0_12, negated_conjecture, ![X8:a > a, X2:a]:(((cLQ @ (esk3_0 @ X2) @ (esk1_0 @ (^[Z0/* 3 */:a]:((cLQ @ Z0 @ (esk3_0 @ (X8 @ Z0)))))))|~((cLQ @ X2 @ (X8 @ (esk3_0 @ X2)))))), inference(spm,[status(thm)],[c_0_7, c_0_6])). 25.71/3.74 thf(c_0_13, negated_conjecture, (cLQ @ (esk1_0 @ (^[Z0/* 3 */:a]:((cLQ @ Z0 @ (esk3_0 @ Z0))))) @ (esk3_0 @ (esk1_0 @ (^[Z0/* 3 */:a]:((cLQ @ Z0 @ (esk3_0 @ Z0))))))), inference(spm,[status(thm)],[c_0_10, c_0_11])). 25.71/3.74 thf(c_0_14, negated_conjecture, ![X2:a]:((~((cLQ @ X2 @ (esk3_0 @ X2)))|~((cLQ @ (esk3_0 @ X2) @ X2)))), inference(split_conjunct,[status(thm)],[c_0_2])). 25.71/3.74 thf(c_0_15, negated_conjecture, (cLQ @ (esk3_0 @ (esk1_0 @ (^[Z0/* 3 */:a]:((cLQ @ Z0 @ (esk3_0 @ Z0)))))) @ (esk1_0 @ (^[Z0/* 3 */:a]:((cLQ @ Z0 @ (esk3_0 @ Z0)))))), inference(spm,[status(thm)],[c_0_12, c_0_13])). 25.71/3.74 thf(c_0_16, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14, c_0_15]), c_0_13])]), ['proof']). 25.71/3.74 # SZS output end CNFRefutation 25.71/3.74 # Parsed axioms : 3 25.71/3.74 # Removed by relevancy pruning/SinE : 0 25.71/3.74 # Initial clauses : 8 25.71/3.74 # Removed in clause preprocessing : 2 25.71/3.74 # Initial clauses in saturation : 6 25.71/3.74 # Processed clauses : 878 25.71/3.74 # ...of these trivial : 170 25.71/3.74 # ...subsumed : 209 25.71/3.74 # ...remaining for further processing : 499 25.71/3.74 # Other redundant clauses eliminated : 0 25.71/3.74 # Clauses deleted for lack of memory : 0 25.71/3.74 # Backward-subsumed : 41 25.71/3.74 # Backward-rewritten : 58 25.71/3.74 # Generated clauses : 50845 25.71/3.74 # ...of the previous two non-redundant : 46357 25.71/3.74 # ...aggressively subsumed : 0 25.71/3.74 # Contextual simplify-reflections : 1 25.71/3.74 # Paramodulations : 50682 25.71/3.74 # Factorizations : 162 25.71/3.74 # NegExts : 0 25.71/3.74 # Equation resolutions : 1 25.71/3.74 # Disequality decompositions : 0 25.71/3.74 # Total rewrite steps : 4949 25.71/3.74 # ...of those cached : 4062 25.71/3.74 # Propositional unsat checks : 0 25.71/3.74 # Propositional check models : 0 25.71/3.74 # Propositional check unsatisfiable : 0 25.71/3.74 # Propositional clauses : 0 25.71/3.74 # Propositional clauses after purity: 0 25.71/3.74 # Propositional unsat core size : 0 25.71/3.74 # Propositional preprocessing time : 0.000 25.71/3.74 # Propositional encoding time : 0.000 25.71/3.74 # Propositional solver time : 0.000 25.71/3.74 # Success case prop preproc time : 0.000 25.71/3.74 # Success case prop encoding time : 0.000 25.71/3.74 # Success case prop solver time : 0.000 25.71/3.74 # Current number of processed clauses : 394 25.71/3.74 # Positive orientable unit clauses : 73 25.71/3.74 # Positive unorientable unit clauses: 0 25.71/3.74 # Negative unit clauses : 14 25.71/3.74 # Non-unit-clauses : 307 25.71/3.74 # Current number of unprocessed clauses: 45044 25.71/3.74 # ...number of literals in the above : 140874 25.71/3.74 # Current number of archived formulas : 0 25.71/3.74 # Current number of archived clauses : 105 25.71/3.74 # Clause-clause subsumption calls (NU) : 12683 25.71/3.74 # Rec. Clause-clause subsumption calls : 10842 25.71/3.74 # Non-unit clause-clause subsumptions : 239 25.71/3.74 # Unit Clause-clause subsumption calls : 2109 25.71/3.74 # Rewrite failures with RHS unbound : 0 25.71/3.74 # BW rewrite match attempts : 1969 25.71/3.74 # BW rewrite match successes : 62 25.71/3.74 # Condensation attempts : 878 25.71/3.74 # Condensation successes : 4 25.71/3.74 # Termbank termtop insertions : 11934567 25.71/3.74 # Search garbage collected termcells : 342 25.71/3.74 25.71/3.74 # ------------------------------------------------- 25.71/3.74 # User time : 2.985 s 25.71/3.74 # System time : 0.158 s 25.71/3.74 # Total time : 3.143 s 25.71/3.74 # Maximum resident set size: 1760 pages 25.71/3.74 25.71/3.74 # ------------------------------------------------- 25.71/3.74 # User time : 2.985 s 25.71/3.74 # System time : 0.161 s 25.71/3.74 # Total time : 3.146 s 25.71/3.74 # Maximum resident set size: 1724 pages 25.71/3.74 % E---3.1 exiting 25.71/3.74 % E exiting 25.71/3.75 EOF